Petri nets and szilard languages
نویسندگان
چکیده
منابع مشابه
Petri Nets, Flat Languages and Linear Arithmetic
We present a method for characterizing the least xed-points of a certain class of Datalog programs in Presburger arithmetic. The method consists in applying some rules of decomposition that transform general sets of computation paths into \\at" ones. We apply the method for expressing the reachability relation of Petri nets as a linear arithmetic formula in order to prove (or disprove) their sa...
متن کاملFormal Translations and Szilard Languages
One of the m e thods for def ining t ranslat ions is the so called syntax-di rec ted t rans la t ion scheme which can be in terpre ted as a pair of ra ther s imilar g rammars wi th the product ions work ing in parallel. Because of the s imilar i ty of the g r a m m a r s each of the two g rammars "f i ts" the other in the sense tha t for each der ivat ion process in one g r a m m a r leading to...
متن کاملRanking and Unranking Left Szilard Languages
We give efficient ranking and unranking algorithms for left Szilard languages of context-free grammars. If O(n2) time and space preprocessing is allowed then each ranking operation is possible in linear time. Unranking takes time O(n log n). These algorithms imply similar algorithms for context-free languages generated by arbitrary unambiguous context-free grammars.
متن کاملSoccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کاملSYNOPS - Generation of Partial Languages and Synthesis of Petri Nets
We present the command line tool SYNOPS. It allows the term-based construction of partial languages consisting of different kinds of causal structures representing runs of a concurrent system: labeled directed acyclic graphs (LDAGs), labeled partial orders (LPOs), labeled stratified directed acyclic graphs (LSDAGs) and labeled stratified order structures (LSOs). It implements region based algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1977
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(77)90558-7